Uniformly distributed measures have big pieces of Lipschitz graphs locally
نویسندگان
چکیده
منابع مشابه
Centrality Measures on Big Graphs: Exact, Approximated, and Distributed Algorithms
Centrality measures allow to measure the relative importance of a node or an edge in a graph w.r.t. other nodes or edges. Several measures of centrality have been developed in the literature to capture different aspects of the informal concept of importance, and algorithms for these different measures have been proposed. In this tutorial, we survey the different definitions of centrality measur...
متن کاملLocal uniform rectifiability of uniformly distributed measures
The study of uniformly distributed measures was crucial in Preiss’ proof of his theorem on rectifiability of measures with positive density. It is known that the support of a uniformly distributed measure is an analytic variety. In this paper, we provide quantitative information on the rectifiability of this variety. Tolsa had already shown that n-uniform measures are uniformly rectifiable. Her...
متن کاملAn index theory for uniformly locally finite graphs
An index theory for uniformly locally finite (ULF) graphs is developed based on the adjacency operator A acting on the space of bounded sequences defined on the vertices. It turns out that the characterization by upper and lower nonnegative eigenvectors is an appropriate tool to overcome the difficulties imposed by the `∞–setting. A distinctive property of the spectral radius r∞(A) in `∞ is the...
متن کاملGraphs with χ=Δ Have Big Cliques
Brooks’ Theorem implies that if a graph has ∆ ≥ 3 and and χ > ∆, then ω = ∆+1. Borodin and Kostochka conjectured that if ∆ ≥ 9 and χ ≥ ∆, then ω ≥ ∆. We show that if ∆ ≥ 13 and χ ≥ ∆, then ω ≥ ∆ − 3. For a graph G, let H(G) denote the subgraph of G induced by vertices of degree ∆. We also show that if χ ≥ ∆, then ω ≥ ∆ or ω(H(G)) ≥ ∆− 5.
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Mathematica
سال: 2019
ISSN: 1239-629X,1798-2383
DOI: 10.5186/aasfm.2019.4422